The Ramsey numbers R(Tn, W6) for Δ(Tn) ≥ n−3
نویسندگان
چکیده
منابع مشابه
The Ramsey Numbers R(Tn, W6) for Small n∗
Let Tn denote a tree of order n and Wm a wheel of order m + 1. Baskoro et al. conjectured in [2] that if Tn is not a star, then R(Tn,Wm) = 2n − 1 for m ≥ 6 even and n ≥ m− 1. We disprove the Conjecture in [6]. In this paper, we determine R(Tn,W6) for n ≤ 8 which is the first step for us to determine R(Tn,W6) for any tree Tn.
متن کاملThe Ramsey numbers of trees versus W6 or W7
1 Let Tn denote a tree of order n and Wm a wheel of order m+1. In this paper, we show the Ramsey 2 numbers R(Tn , W6) = 2n − 1 + μ for n ≥ 5, where μ = 2 if Tn = Sn, μ = 1 if Tn = Sn(1, 1) or 3 Tn = Sn(1, 2) and n ≡ 0 (mod 3), and μ = 0 otherwise; R(Tn , W7) = 3n − 2 for n ≥ 6. 4 © 2005 Elsevier Ltd. All rights reserved. 5
متن کاملThe Ramsey numbers R(Tn, W6) for Delta (Tn) geq n-3
K e y w o r d s R a m s e y number, Tree, Wheel. 1. I N T R O D U C T I O N All graphs considered in this paper are finite simple graphs without loops. For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest positive integer n such that for any graph G of order n, either G contains G1 or G contains G2, where G is the complement of G. Let G be a graph. We use V(G) and E(G) to...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملA Conjecture of Erdős the Ramsey Number r(W6)
It was conjectured by Paul Erdős that if G is a graph with chromatic number at least k, then the diagonal Ramsey number r(G) ≥ r(Kk). That is, the complete graph Kk has the smallest diagonal Ramsey number among the graphs of chromatic number k. This conjecture is shown to be false for k = 4 by verifying that r(W6) = 17, where W6 is the wheel with 6 vertices, since it is well known that r(K4) = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2004
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(04)90064-x